Decomposition of nD-rotations: Classification, properties and algorithm
نویسندگان
چکیده
In this paper, the decomposition of nD-rotations is studied. Using this decomposition, nD-rotations are classified and properties are underlined. For each class, an algorithm previously presented by the authors to decompose nD-rotation into planar rotations is proposed and a generalized algorithm is presented. Moreover, an alternate algorithm based on the Schur decomposition is investigated. A comparison between these different algorithms is finally provided.
منابع مشابه
Nano- TiO2/Nd Deposited on -Fe2O3 as a Magnetically Separable Photocatalyst
TiO2/Magnetit and TiO2/Nd/Magnetit were prepared and used for photocatalytic decomposition of the methylorange as a pollutant. TiO2 and TiO2/Nd were prepared by sol gel method and were characterized using XRD, FT IR and TEM. The prepared catalysts were deposited on magnetite surface to have a catalyst with magnetite core. So the catalyst can be separated easily from the waste solution by a magn...
متن کاملUpdating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کاملRecycling Givens Rotations for the Efficient Approximation of Pseudospectra of Band–dominated Operators
We study spectra and pseudospectra of certain bounded linear operators on l(Z) . The operators are generally non-normal, and their matrix representation has a characteristic offdiagonal decay. Based on a result of Chandler-Wilde, Chonchaiya and Lindner for tridiagonal infinite matrices, we demonstrate an efficient algorithm for the computation of upper and lower bounds on the pseudospectrum of ...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملThe Normalized Singular Value Decomposition of Non-Symmetric Matrices Using Givens fast Rotations
In this paper we introduce the algorithm and the fixed point hardware to calculate the normalized singular value decomposition of a non-symmetric matrices using Givens fast (approximate) rotations. This algorithm only uses the basic combinational logic modules such as adders, multiplexers, encoders, Barrel shifters (B-shifters), and comparators and does not use any lookup table. This method in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphical Models
دوره 73 شماره
صفحات -
تاریخ انتشار 2011